A Wheel 1 - Safe Petri Net Generating all the { 0 , 1 } n Sequences Gajendra
نویسنده
چکیده
Petri nets are a graphic and mathematic modeling tool which is applicable to several systems and to all those systems presenting particular characteristics such as concurrency, distribution, parallelism, non-determinism and/or stochastically. In this paper, a wheel Petri net whose reachability tree contains all the binary ntuples or sequences as marking vectors has been defined. The result is proved by the using of the Principle of Mathematical Induction (PMI) on |P | = n.
منابع مشابه
Existence and Uniqueness of a Minimum Crisp Boolean Petri Net
In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2n binary n-vectors has been found. In this paper, the existence and unique...
متن کاملConstruction of a Crisp Boolean Petri Net from a 1-safe Petri Net
The concept of a Petri net, a tool for the study of certain discrete dynamical systems, was invented in 1939 by Carl Adam Petri. In the attempt to characterize Boolean Petri nets, we discovered a subclass of Boolean Petri net called the crisp Boolean Petri net, viz. , the one that generates every binary vector as its marking vectors exactly once. In this paper, the construction of a crisp Boole...
متن کاملEmbedding an Arbitrary 1-safe Petri Net into a Boolean Petri Net
Petri, C. A. , Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn, 1962. Callou, G. , Macial, P. , Tutsch, D. , Araujo, J. , Ferreira, J. and Souza, R. , A Petri net-based approach to the quantification of data center dependability. In: Petri nets—Manufacturing and Computer Science (Ed. : Pawel Pawlewski), 2012, 313-336. Dassow, J. , Mavlankulov, G. , Othm...
متن کاملOn the Problem of Characterizing Boolean Petri Nets
Petri nets are used for describing, designing and studying discrete event-driven systems that are characterized as being concurrent, asynchronous, distributed, parallel, and/or nondeterministic. As a graphical tool, Petri net can be used for planning and designing a system with given objectives, more effectively than flowcharts and block diagrams. As a mathematical tool, it enables one to set u...
متن کاملReducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets
It is a well-known fact that for every k-safe Petri net, i.e. a Petri net in which no place contains more than k 2 N tokens under any reachable marking, there is a 1-safe Petri net with the same interleaving behaviour. Indeed these types of Petri nets generate regular languages. In this paper, we show that this equivalence of k-safe and 1-safe Petri nets holds also for their pomset languages, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013